منابع مشابه
Recursive Session Types Revisited
Session types model structured communication-based programming. In particular, binary session types for the πcalculus describe communication between exactly two participants in a distributed scenario. Adding sessions to the πcalculus means augmenting it with type and term constructs. In a previous paper, we tried to understand to which extent the session constructs are more complex and expressi...
متن کاملMarkov Types Again Revisited
The method of types is one of the most popular techniques in information theory and combinatorics. Two sequences of equal length have the same type if they have identical empirical distributions. In this paper, we focus on Markov types, that is, sequences generated by a Markov source (of order one). We note that sequences having the same Markov type share the same so called balanced frequency m...
متن کاملInductive Data Types: Well-ordering Types Revisited
We consider Martin-Löf’s well-ordering type constructor in the context of an impredicative type theory. We show that the well-ordering types can represent various inductive types faithfully in the presence of the filling-up equality rules or η-rules. We also discuss various properties of the filling-up rules. ! " ! # $ % &" '( ) '* + '' + ,. '' " ''/0 % &..'1 " '2 34",5 6 ,5/0 7 % ! 0 " ! # &" ...
متن کاملArchitectural Types Revisited: Extensible And/Or Connections
The problem of formalizing architectural styles has been recently tackled with the introduction of the concept of architectural type. The internal behavior of the system components can vary from instance to instance of an architectural type in a controlled way, which preserves the absence of deadlock related architectural mismatches proved via the architectural compatibility and interoperabilit...
متن کاملTeams as types: Authorization in groupware revisited
We present a generic framework called LOGOS that may serve as a formal basis for investigations of authorization issues in groupware systems. LOGOS has been formulized within HOL a well-known higher-order logic, which is supported by a number of wide-spread theorem provers as e.g. Isabelle/HOL.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2002
ISSN: 0035-7596
DOI: 10.1216/rmjm/1181070037